Spacetime Catmull Recursive Subdivision facilitated with Occlusion Culling

نویسنده

  • Andreas Genz
چکیده

We describe an extension and a generalization of the Catmull recursive subdivision algorithm: first, an imagebased occlusion culling stage is added; second, all rendering stages, that is, view-frustum and occlusion culling, subdivision of geometric primitives into micropolygons, and rasterization, are performed in spacetime. Operating in spacetime allows to exploit temporal coherence in animated scenes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Relationship Between RATS-splines and the Catmull and Clark B-splines

This paper presents the relationship between the Recursive Arbitrary Topology Splines (RATS) method, derived by the authors, and the Catmull and Clark recursive B-Spline method. Both methods are capable of defining surfaces of any arbitrary topology of control points. They "fill-in" n-sided regions with foursided patches. The Catmull & Clark method is derived from the midpoint subdivision of B-...

متن کامل

TSS BVHs: Tetrahedron Swept Sphere BVHs for Ray Tracing Subdivision Surfaces

We present a novel, compact bounding volume hierarchy, TSS BVH, for ray tracing subdivision surfaces computed by the Catmull-Clark scheme. We use Tetrahedron Swept Sphere (TSS) as a bounding volume to tightly bound limit surfaces of such subdivision surfaces given a user tolerance. Geometric coordinates defining our TSS bounding volumes are implicitly computed from the subdivided mesh via a sim...

متن کامل

Inscribed Approximation based Adaptive Tessellation of Catmull-Clark Subdivision Surfaces

Catmull-Clark subdivision scheme provides a powerful method for building smooth and complex surfaces. But the number of faces in the uniformly refined meshes increases exponentially with respect to subdivision depth. Adaptive tessellation reduces the number of faces needed to yield a smooth approximation to the limit surface and, consequently, makes the rendering process more efficient. In this...

متن کامل

Adaptive Rendering of Catmull-Clark Subdivision Surfaces based on Inscribed Approximation

Subdivision provides a powerful scheme for building smooth and complex surfaces. But the number of faces in the uniformly refined meshes increases exponentially with respect to subdivision depth. Adaptive rendering reduces the number of faces needed to yield a smooth approximation to the limit surface and, consequently, makes the rendering process more efficient. In this paper, we present a new...

متن کامل

Generation of Subdivision Hierarchies for Efficient Occlusion Culling of Large Polygonal Models

Efficient handling of large polygonal scenes has always been a challenging task. In recent years, view-frustum and occlusion culling have drawn a lot of attention for reducing the complexity of those scenes. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005